Sequential Implementation of Parallel Narrowing
نویسنده
چکیده
Parallel narrowing has been proposed by Antoy, Echahed and Hanus. They generalize to narrowing the notion of necessary set of redexes introduced by Sekar and Ramakrishnan. We present a high-level implementation by transforming weakly orthogonal, constructor-based programs into Prolog with the help of parallel deenitional trees. For strategies based on parallel rewriting, this is particularly diicult, because we have to take into consideration the whole term. A better strategy is obtained by combining parallel narrowing with simpliication, exploiting both determinism and expression parallelism. We point out the advantages of the new strategy by comparative measurements.
منابع مشابه
Multi-paradigm Logic Programming Sequential Implementation of Parallel Narrowing
Parallel Narrowing is a narrowing strategy which exploits expression parallelism. We present the rst implementation by transforming weakly orthogonal, constructor-based programs into Prolog with the help of parallel deenitional trees. We deene translation scheme for the general case of multistep narrowing, which is then extended to parallel narrowing by additional elimination rules. Our impleme...
متن کاملParallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landmark techniques in this area: the computation of unifiers performed by needed narrowing in inductively sequential rewrite systems and the simultaneous reduction of a necessary set of redexes performed by rewriting in wea...
متن کاملA conservative scheme for parallel interval narrowing
An efficient parallel interval narrowing algorithm for solving numerical problems is designed, implemented and tested. Differences with the corresponding sequential algorithm are clearly stated. The algorithm’s performance is analyzed in the Bulk-Synchronous Parallel (BSP) cost model which suggests speed-ups on highbandwidth architectures. Experimental results on a massively parallel machine Cr...
متن کاملImplementing Natural Rewriting and Narrowing Efficiently
Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel extension, known as weakly, deals with non-inductively sequential constructor systems. Recently, refinements of (weakly) outermost-needed rewriting and narrowing have been obtained. These new strategies are called natural rewriting...
متن کاملDesign and Implementation of a High Speed Systolic Serial Multiplier and Squarer for Long Unsigned Integer Using VHDL
A systolic serial multiplier for unsigned numbers is presented which operates without zero words inserted between successive data words, outputs the full product and has only one clock cycle latency. 
The multiplier is based on a modified serial/parallel scheme with two adjacent multiplier cells. Systolic concept is a well-known means of intensive computational task through replication of fu...
متن کامل